Σ-Protocols Based on n-One-Way Group Homomorphisms
ثبت نشده
چکیده
منابع مشابه
Homomorphisms between Solomon's Descent Algebras
In a previous paper (see Garsia-Reutenauer [2]), we have studied algebraic properties of the descent algebras Σ n , and shown how these are related to the canonical decomposition of the free Lie algebra corresponding to a version of Poincaré-Birkhoff-Witt's theorem. In the present paper, we study homomorphisms between these algebras Σ n. The existence of these homomorphisms was suggested by pro...
متن کاملEfficiency Limitations for Σ-Protocols for Group Homomorphisms
Efficient zero-knowledge proofs of knowledge for group homomorphisms are essential for numerous systems in applied cryptography. Especially, Σ-protocols for proving knowledge of discrete logarithms in known and hidden order groups are of prime importance. Yet, while these proofs can be performed very efficiently within groups of known order, for hidden order groups the respective proofs are far...
متن کاملEfficient Proofs of Knowledge of Discrete Logarithms and Representations in Groups with Hidden Order
For many one-way homomorphisms used in cryptography, there exist efficient zero-knowledge proofs of knowledge of a preimage. Examples of such homomorphisms are the ones underlying the Schnorr or the Guillou-Quisquater identification protocols. In this paper we present, for the first time, efficient zero-knowledge proofs of knowledge for exponentiation ψ(x1) . = h1 1 and multi-exponentiation hom...
متن کاملThe Complexity of Homomorphisms of Signed Graphs and Signed Constraint Satisfaction
A signed graph (G,Σ) is an undirected graph G together with an assignment of signs (positive or negative) to all its edges, where Σ denotes the set of negative edges. Two signatures are said to be equivalent if one can be obtained from the other by a sequence of resignings (i.e. switching the sign of all edges incident to a given vertex). Extending the notion of usual graph homomorphisms, homom...
متن کاملA Certifying Compiler for Zero-Knowledge Proofs of Knowledge Based on Σ-Protocols (Full Version)
Zero-knowledge proofs of knowledge (ZK-PoK) are important building blocks for numerous cryptographic applications. Although ZK-PoK have very useful properties, their real world deployment is typically hindered by their significant complexity compared to other (non-interactive) crypto primitives. Moreover, their design and implementation is time-consuming and error-prone. We contribute to overco...
متن کامل